Confluence Reduction for Markov Automata

نویسندگان

Mark Timmer

Jaco van de Pol

Mariëlle Stoelinga

چکیده

Article history: Received 7 July 2015 Accepted 12 January 2016 Available online 19 January 2016

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient modelling, generation and analysis of Markov automata

Quantitative model checking is concerned with the verification of both quantitative and qualitative properties over models incorporating quantitative information. Increases in expressivity of the models involved allow more types of systems to be analysed, but also raise the difficulty of their efficient analysis. Three years ago, the Markov automaton (MA) was introduced as a generalisation of p...

متن کامل

Confluence versus Ample Sets in Probabilistic Branching Time

To improve the efficiency of model checking in general, and probabilistic model checking in particular, several reduction techniques have been introduced. Two of these, confluence reduction and partial-order reduction by means of ample sets, are based on similar principles, and both preserve branching-time properties for probabilistic models. Confluence reduction has been introduced for probabi...

متن کامل

Formal Methods and Tools Master’s Thesis A comparison of state space reduction techniques in SCOOP

In quantitative model checking we are concerned with verifying both quantitative and qualitative properties over models. Markov Automata are what we use to model these systems. In these transition systems nondeterminism, probabilistic behaviour and behaviour over time can all be modelled. SCOOP is a tool that uses several techniques, including confluence reduction and dead variable reduction, t...

متن کامل

Confluence Reduction for Probabilistic Systems

This paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prove that this reduction preserves branching probabilistic bisimulation and can be applied on-the-fly. To support the technique, we introduce a method for detecting confluent transitions in the context of a probabilistic...

متن کامل